For the eigenvalue function on symmetric matrices, we have gathered a number of it’s properties. We show that this map has the properties of continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability. Eigenvalue function will be extended to a larger set of matrices and then the listed properties will prove again.

Smart systems in general, and specifically neural networks, are expected to be of great assistance in large scale matrix computation. However it was necessary to work with smaller problems at first step. To this end, a method based on using perceptrons and Kohonen networks for determining the first three modal frequencies of frames of up to 20 stories high and two bays wide from their stiffness and mass matrices, was developed. This paper introduces this modular network as a preferable alternative for designing smart systems for learning large scale mapping problems in structural engineering, and in addition, reports the successful application of this modular network to the eigenvalue and modal frequency determination of shear frame structures.

The stability analysis of islanded inverter-based microgrids (IBMGs) is increasingly an important and challenging topic due to the nonlinearity of IBMGs. In this paper, a new linear model for such microgrids as well as an iterative method to correct the linear model is proposed. Using the linear model makes it easy to analyze the eigenvalues and stability of IBMGs due to the fact that it derives the eigenvalues directly and the linearization around an operating point to study the small signal stability and also use the newton-raphson method or other load flow solutions to solve these systems are no longer needed. An effective eigenvalue calculator is developed which is able to calculate the eigenvalues of IBMGs in the first few iterations of the proposed method. The proposed method provides the superior performance considering the simulation time compared to the conventional methods. The validation and comparison of the results show the performance of the proposed method.

Please click on PDF file in Persian to view the abstract.

Let $\mathtt{A}(\mathtt{G})$ be the adjacency matrix of a simple connected undirected graph $\mathtt{G}$. A graph $\mathtt{G}$ of order $n$ is said to be non-singular (respectively singular) if $\mathtt{A}(\mathtt{G})$ is non-singular (respectively singular). The spectrum of a graph $\mathtt{G}$ is the set of all its eigenvalues denoted by $spec(\mathtt{G})$. The anti-reciprocal (respectively reciprocal) eigenvalue property for a graph $\mathtt{G}$ can be defined as `` Let $\mathtt{G}$ be a non-singular graph $\mathtt{G}$ if the negative reciprocal (respectively positive reciprocal) of each eigenvalue is likewise an eigenvalue of $\mathtt{G}$, then $\mathtt{G}$ has anti-reciprocal (respectively reciprocal) eigenvalue property ." Furthermore, a graph $\mathtt{G}$ is said to have strong anti-reciprocal eigenvalue property (resp. strong reciprocal eigenvalue property) if the eigenvalues and their negative (resp. positive) reciprocals are of same multiplicities. In this article, graphs satisfying anti-reciprocal eigenvalue (or property $(-\mathtt{R})$) and strong anti-reciprocal eigenvalue property (or property $(-\mathtt{SR})$) are discussed.

In this research, we introduce an approach to , nd a family of sixth order Sturm-Liouville problems having the same spectrum. Using Darboux Lemma and the fact that any second order Sturm-Liouville problem with the Dirichlet boundary conditions is equivalent to a sixth order Sturm-Liouville problem, the considered problems are formulated.